Speeding up COMPASS for high-dimensional discrete optimization via simulation

The convergent optimization via most promising area stochastic search (COMPASS) algorithm is a locally convergent randomsearch algorithm for solving discrete optimization via simulation problems. COMPASS has drawn a significant amount of attention since its introduction. While the asymptotic convergence of COMPASS does not depend on the problem dimension, the finite-time performance of the algorithm often deteriorates as the dimension increases. In this paper, we investigate the reasons for this deterioration and propose a simple change to the solution-sampling scheme that significantly speeds up COMPASS for high-dimensional problems without affecting its convergence guarantee. © 2010 Elsevier B.V. All rights reserved.